A Pseudo-Parallel Genetic Algorithm Integrating Simulated Annealing for Stochastic Location-Inventory-Routing Problem with Consideration of Returns in E-Commerce
نویسندگان
چکیده
منابع مشابه
A Hybrid Genetic-Simulated Annealing Algorithm for the Location-Inventory-Routing Problem Considering Returns under E-Supply Chain Environment
Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focus...
متن کاملA realistic perish ability inventory management for location-inventory-routing problem based on Genetic Algorithm
In this paper, it was an attempt to be present a practical perishability inventory model. The proposed model adds using spoilage of products and variable prices within a time period to a recently published location-inventory-routing model in order to make it more realistic. Aforementioned model by integration of strategic, tactical and operational level decisions produces better results for sup...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملParallel Recombinative Simulated Annealing: a Genetic Algorithm Parallel Recombinative Simulated Annealing: a Genetic Algorithm
This paper introduces and analyzes a parallel method of simulated annealing. Borrowing from genetic algorithms, an eeective combination of simulated annealing and genetic algorithms, called parallel recombinative simulated annealing, is developed. This new algorithm strives to retain the desirable asymptotic convergence properties of simulated annealing, while adding the populations approach an...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2015
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2015/586581